Tractable Parameterizations for the Minimum Linear Arrangement Problem
نویسندگان
چکیده
منابع مشابه
The planar minimum linear arrangement problem is different from the minimum linear arrangement problem
In various research papers, such as [2], one will find the claim that the minLA is optimally solvable on outerplanar graphs, with a reference to [1]. However, the problem solved in that publication, which we refer to as the planar minLA, is different from the minLA, as we show in this article. In constrast to the minimum linear arrangement problem (minLA), the planar minimum linear arrangement ...
متن کاملA Hybrid Genetic Algorithm for the Minimum Linear Arrangement Problem
This paper presents a hybrid genetic algorithm for the minimum linear arrangement problem. The algorithm was tested on a collection of 22 sparse graphs that has been used to test twelve other algorithms for the minimum linear arrangement problem. The graphs have up to 10,240 vertices and up to 49,820 edges. On about 2/3 of the graphs, our algorithm found solutions superior to all other algorith...
متن کاملAn improved approximation ratio for the minimum linear arrangement problem
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-linear arrangement problem. This improves over the O(log n)-approximation of Rao and Richa.
متن کاملThe minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 Preliminaries Let F be a family of nonempty sets. The intersection graph of F is obtained by representing each set in F by a vertex and connecting two vertices by an edge if and only if their corresponding sets interse...
متن کاملDecorous Lower Bounds for Minimum Linear Arrangement
Alberto Caprara DEIS, Università di Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy, [email protected] Adam N. Letchford Department of Management Science, Lancaster University, Lancaster LA1 4YX, Great Britain, [email protected] Juan-José Salazar-González DEIOC, Universidad de La Laguna, c/ Astrof́ısico Francisco Sánchez, s/n E-38271 La Laguna, Tenerife, Spain, jjsalaza@...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2016
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2898352